Memory-Conserving Bounding Volume Hierarchies with Coherent Raytracing

نویسندگان

  • Jeffrey Mahovsky
  • Brian Wyvill
چکیده

Bounding volume hierarchies (BVH) are a commonly-used method for speeding up ray tracing, but they can consume a large amount of memory for complex scenes. We present a new scheme for storing BVHs that reduces the storage requirements by up to 79%. This scheme has significant computational overhead, but this can be reduced to negligible levels by shooting bundles of rays through the BVH (coherent ray tracing). This gives the speed of a coherency-based ray tracer combined with large memory savings, permitting rendering of larger scenes and reducing the cost of a hardware ray tracer.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two Optimization Methods for Raytracing Two Optimization Methods for Raytracing

Raytracing is a method to produce photo-realistic pictures. For each pixel of an image one ray is shot to nd the object, which determines the color of the pixel. Rays are also used to simulate shadows and reeections. Previously bounding volume hierarchies have been used to speed raytracing. A new method to speed the traversal of a bounding volume hierarchy is presented. Optimisation methods to ...

متن کامل

Ray Tracing with the Single Slab Hierarchy

Bounding volume hierarchies have become a very popular way to speed up ray tracing. In this paper we present a novel traversal and approximation scheme for bounding volume hierarchies, which is comparable in speed, has a very compact traversal algorithm and uses only 25% of the memory, compared to a standard bounding volume hierarchy.

متن کامل

Using Half-Precision Floating-Point Numbers for Storing Bounding Volume Hierarchies

Bounding volume hierarchies, which are commonly used to speed up ray tracing, are heavily accessed during ray traversal. Reducing the memory footprint for the bounding volume hierarchies leads to a better cache hit ratio and, therefore, faster ray tracing. This paper examines an approach of using 16-bit halfprecision floating-point numbers to store bounding volume hierarchy inner nodes. Compare...

متن کامل

GPU Volume Raycasting using Bounding Interval Hierarchies

Traditional Direct Volume Raycasting (DVR) on the GPU is limited to uniform voxel grids stored as 3D textures. This approach is not optimal for sparse data sets or data sets with highly varying frequencies because it requires a trade-off between data structure size and the maximum reproducible frequency and it lacks implicit empty space skipping during raycasting. In this paper we present anoth...

متن کامل

Cache-Efficient Layouts of Bounding Volume Hierarchies

We present a novel algorithm to compute cache-efficient layouts of bounding volume hierarchies (BVHs) of polygonal models. Our approach does not make any assumptions about the cache parameters or block sizes of the memory hierarchy. We introduce a new probabilistic model to predict the runtime access patterns of a BVH. Our layout computation algorithm utilizes parent-child and spatial localitie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 25  شماره 

صفحات  -

تاریخ انتشار 2006